On utilizing an enhanced object partitioning scheme to optimize self-organizing lists-on-lists
نویسندگان
چکیده
منابع مشابه
A Novel Framework for Self-Organizing Lists in Environments with Locality of Reference: Lists-on-Lists
We examine the problem of self-organizing linear search lists, which are lists that react to queries received from an environment by running a heuristic to reorganize the records in order to minimize the search cost. In particular, we are concerned with environments with the locality of reference phenomenon, when the queries exhibit a probabilistic dependence between themselves. We introduce a ...
متن کاملMixing Times of Self-Organizing Lists and Biased Permutations
Sampling permutations from Sn is a fundamental problem from probability theory. The nearest neighbor transposition chain Mnn is known to converge in time Θ(n log n) in the uniform case [18] and time Θ(n) in the constant bias case, in which we put adjacent elements in order with probability p 6= 1/2 and out of order with probability 1− p [2]. Here we consider the variable bias case where the pro...
متن کاملSelf-Organizing Lists and Independent References: A Statistical Synergy
Let R I' ... ,RII be a linear list of n elements. We assume the independent reference model, with a ftxed but unknown access probab,ility vector. The problem of dynamically reorganizing the list, on the basis of accrued references, with the objective of minimizing the expected access-cost is surveyed. The Counter Scheme (CS) is known to be asymptotically optimal for this purpose. This paper con...
متن کاملAdaptive low-power address encoding techniques using self-organizing lists
Off-chip bus transitions are a major source of power dissipation for embedded systems. In this paper, new adaptive encoding schemes are proposed that significantly reduce transition activity on data and multiplexed address buses. These adaptive techniques are based on self-organizing lists to achieve reduction in transition activity by exploiting the spatial and temporal locality of the address...
متن کاملMore on Lazy Lists
This theory contains some useful extensions to the LList theory by Larry Paulson, including finite, infinite, and positive llists over an alphabet, as well as the new constants take and drop and the prefix order of llists. Finally, the notions of safety and liveness in the sense of [1] are defined.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Evolving Systems
سال: 2020
ISSN: 1868-6478,1868-6486
DOI: 10.1007/s12530-020-09327-4